Automorphism groups of circulant graphs — a survey
نویسنده
چکیده
A circulant (di)graph is a (di)graph on n vertices that admits a cyclic automorphism of order n. This paper provides a survey of the work that has been done on finding the automorphism groups of circulant (di)graphs, including the generalisation in which the edges of the (di)graph have been assigned colours that are invariant under the aforementioned cyclic automorphism. Mathematics Subject Classification (2000). 05C25.
منابع مشابه
Automorphism Groups of Rational Circulant Graphs
The paper concerns the automorphism groups of Cayley graphs over cyclic groups which have a rational spectrum (rational circulant graphs for short). With the aid of the techniques of Schur rings it is shown that the problem is equivalent to consider the automorphism groups of orthogonal group block structures of cyclic groups. Using this observation, the required groups are expressed in terms o...
متن کاملAutomorphism Groups and Spectra of Circulant Graphs
We explore ways to concisely describe circulant graphs, highly symmetric graphs with properties that are easier to generalize than other graphs. We introduce connection sets as a way to describe isomorphism among some circulant graphs and discuss Ádám’s conjecture that attempts to generalize this idea to all circulant graphs, exploring cases in which the conjecture holds and cases in which it f...
متن کاملAutomorphism Groups of Circulant Digraphs With Applications to Semigroup Theory
We characterize the automorphism groups of circulant digraphs whose connection sets are relatively small, and of unit circulant digraphs. For each class, we either explicitly determine the automorphism group or we show that the graph is a “normal” circulant, so the automorphism group is contained in the normalizer of a cycle. Then we use these characterizations to prove results on the automorph...
متن کاملOn automorphism groups of circulant digraphs of square-free order
We show that the full automorphism group of a circulant digraph of square-free order is either the intersection of two 2-closed groups, each of which is the wreath product of 2-closed groups of smaller degree, or contains a transitive normal subgroup which is the direct product of two 2-closed groups of smaller degree. The work in this paper makes contributions to the solutions of two problems ...
متن کاملOn the Automorphism Group of Integral Circulant Graphs
The integral circulant graph Xn(D) has the vertex set Zn = {0, 1, 2, . . . , n − 1} and vertices a and b are adjacent, if and only if gcd(a − b, n) ∈ D, where D = {d1, d2, . . . , dk} is a set of divisors of n. These graphs play an important role in modeling quantum spin networks supporting the perfect state transfer and also have applications in chemical graph theory. In this paper, we deal wi...
متن کامل